A proof of the Barát-Thomassen conjecture
نویسندگان
چکیده
The Barát-Thomassen conjecture asserts that for every tree T on m edges, there exists a constant kT such that every kT -edge-connected graph with size divisible by m can be edge-decomposed into copies of T . So far this conjecture has only been verified when T is a path or when T has diameter at most 4. Here we prove the full statement of the conjecture.
منابع مشابه
Decomposing Highly Connected Graphs into Paths of Length Five
Barát and Thomassen (2006) posed the following decomposition conjecture: for each tree T , there exists a natural number kT such that, if G is a kT -edge-connected graph and |E(G)| is divisible by |E(T )|, then G admits a decomposition into copies of T . In a series of papers, Thomassen verified this conjecture for stars, some bistars, paths of length 3, and paths whose length is a power of 2. ...
متن کاملEdge-partitioning a graph into paths: beyond the Barát-Thomassen conjecture
The Barát-Thomassen conjecture asserts that there is a function f such that for every fixed tree T with t edges, every graph which is f(t)edge-connected with its number of edges divisible by t has a partition of its edges into copies of T . This has been proved in the case of paths of length 2 by Thomassen [14], and recently shown to be true for all paths by Botler, Mota, Oshiro and Wakabayashi...
متن کاملEdge-decomposition of Graphs into Copies of a Tree with Four Edges
We study edge-decompositions of highly connected graphs into copies of a given tree. In particular we attack the following conjecture by Barát and Thomassen: for each tree T , there exists a natural number kT such that if G is a kT -edge-connected graph, and |E(T )| divides |E(G)|, then E(G) has a decomposition into copies of T . As one of our main results it is sufficient to prove the conjectu...
متن کاملOrienting Triangulations
We show that the edges of any triangulation of a closed surface different from the projective plane and the sphere can be oriented such that every vertex has non-zero outdegree divisble by three. This confirms a conjecture of Barát and Thomassen.
متن کاملRandom 4-regular graphs have claw-decompositions asymptotically almost surely
In 2006, Barát and Thomassen conjectured that the edges of every planar 4-regular 4-edgeconnected graph can be decomposed into claws. Shortly afterward, Lai constructed a counterexample to this conjecture. Using the small subgraph conditioning method of Robinson and Wormald, we find that a random 4-regular graph has a claw-decomposition asymptotically almost surely, provided that the number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 124 شماره
صفحات -
تاریخ انتشار 2017